Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
نویسندگان
چکیده
منابع مشابه
Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design
A parting line for a polyhedron is a closed curve on its surface, which identiies the two halves of the polyhedron for which mold-boxes must be made. A parting line is undercut-free if the two halves that it generates do not contain facets that obstruct the de-molding of the polyhedron. Computing an undercut-free parting line that is as \\at" as possible is an important problem in mold design. ...
متن کاملComputing a Attest, Undercut{free Parting Line for a Convex Polyhedron, with Application to Mold Design ?
A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It deenes the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of P. Computing an undercut-free parting line that is as at as possible is an important problem in mold design. In this paper, an...
متن کاملFinding Undercut-Free Parting Directions for Polygons with Curved Edges
We consider the problem of whether a given geometry can be molded in a two-part, rigid, reusable mold with opposite removal directions. We describe an efficient algorithm for solving the opposite direction moldability problem for a 2D “polygon” bounded by edges that may be either straight or curved. We introduce a structure, the normal graph of the polygon, that represents the range of normals ...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولHow to Cut out a Convex Polyhedron
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the complexity of the algorithm in [MP] remains an open problem. In this paper we show that every convex polyhedron P ⊂ R can be obtained in polynomial time, by starting with a cube which contains P and sequentially cutting out the extra parts of the surface. Our main tool is of independent interest. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1999
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00023-1